hierarchical graph

hierarchical graph
мат.
иерархический граф

English-Russian scientific dictionary. 2008.

Игры ⚽ Поможем написать реферат

Смотреть что такое "hierarchical graph" в других словарях:

  • Graph Modelling Language — (GML) is a hierarchical ASCII based file format for describing graphs. Applications supporting GML * Cytoscape, an open source bioinformatics software platform for visualizing molecular interaction networks, loads and save previously constructed… …   Wikipedia

  • Graph (data structure) — In computer science, a graph is a kind of data structure, specifically an abstract data type (ADT), that consists of a set of nodes (also called vertices) and a set of edges that establish relationships (connections) between the nodes. The graph… …   Wikipedia

  • Hierarchical Bayes model — The hierarchical Bayes method is one of the most important topics in modern Bayesian analysis. It is a powerful tool for expressing rich statistical models that more fully reflect a given problem than a simpler model could. Given data x,! and… …   Wikipedia

  • Hierarchical classifier — A hierarchical classifier is a method of classifying inputs into defined output categories. The classification occurs first on a low level with highly specific pieces of input data. The classifications of the individual pieces of data are then… …   Wikipedia

  • Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

  • Node graph architecture — is a type of software design which builds around modular node components which can be connected together to form a graph. Often the software s underlying node graph architecture is also exposed to the end user as a 2 dimensional visualization of… …   Wikipedia

  • Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue …   Wikipedia

  • Power graph analysis — In computational biology, power graph analysis is a method for the analysis andrepresentation of complex networks. Power graph analysis is the computation, analysis and visual representation of a power graph from a graphs (networks).Power graph… …   Wikipedia

  • Outerplanar graph — A maximal outerplanar graph and its 3 coloring. In graph theory, an undirected graph is an outerplanar graph if it can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing.… …   Wikipedia

  • Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… …   Wikipedia

  • Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»